Computational analysis of 4-8 meshes with application to surface simplification using global error

We present computational results when computing approximations of a class of meshes with subdivision connectivity, known as 4-8 meshes. We consider algorithms using vertex decimation or vertex insertion. We explain that a full decomposition of a 4-8 mesh using global error can be obtained with an (n logn) decimation algorithm. Our algorithm produces progressive and adaptive representations of terrain data or subdivision surfaces in R having arbitrary topology.